Distance <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e55" altimg="si14.svg"><mml:mi>r</mml:mi></mml:math>-domination number and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e60" altimg="si14.svg"><mml:mi>r</mml:mi></mml:math>-independence complexes of graphs
نویسندگان
چکیده
For r≥1, the r-independence complex of a graph G, denoted Indr(G), is simplicial whose faces are subsets I⊆V(G) such that each component induced subgraph G[I] has at most r vertices. In this article, we establish relation between distance r-domination number G and (homological) connectivity Indr(G). We also prove for chordal either contractible or homotopy equivalent to wedge spheres. Given spheres, provide construction type given wedge.
منابع مشابه
Domination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کامل2-domination in Bipartite Graphs with Odd Independence Number
For a positive integer k, a set of vertices S in a graph G is said to be a k-dominating set if each vertex x in V (G) − S has at least k neighbors in S. The cardinality of a smallest k-dominating set of G is called the k-domination number of G and is denoted by γk(G). The independence number of a graph G is denoted by α(G). In [Australas. J. Combin. 40 (2008), 265–268], Fujisawa, Hansberg, Kubo...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2022
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103508